Parallel Packet Switching Using Multiplexors with Virtual Input Queues
نویسندگان
چکیده
Parallel Packet Switches (PPS) use internal, parallel switch planes that operate at less than line speed. A PPS can scale-up to faster line speeds than a single-plane switch can. Load balancing between planes and providing QoS to flows are open problems. We investigate the performance of a new “VIQ PPS” that distributes cells or variable-length packets to planes and uses multiplexors with virtual input queues (VIQ). A VIQ at an output multiplexor consists of one FIFO queue for each input. Simulation is used to evaluate the performance of a 10-Gbps VIQ PPS that contains ten 1Gbps switch planes. It is found that at high offered loads the mean delay of a VIQ PPS switch is lower than that of a single-plane iSLIP switch. For unbalanced loads, the VIQ PPS demonstrates stability where an iSLIP switch is unstable. Especially promising results are shown for VIQ PPS native switching of variable-length Ethernet packets.
منابع مشابه
A parallel packet switch with multiplexors containing virtual input queues
A packet switch with parallel switching planes is a parallel packet switch (PPS). A PPS can scale-up to faster line speeds than can a singleplane switch. It is an open problem to design a PPS that is feasible to implement using existing low-cost hardware components where no component runs faster than line speed. A PPS must be able to internally load balance traffic, have packet delays comparabl...
متن کاملA Parallel Packet Switch Architecture with Input-output-queued Switches and Buffering in the Demultiplexors
A packet switch with parallel switching planes is a parallel packet switch (PPS). A PPS can scale-up to larger aggregate capacity and faster line speeds than can a single plane. It is an open problem to design a PPS that is feasible to implement using multiple lower speed packet switches. Many solutions proposed previously are essentially impractical because of high communication complexity. In...
متن کاملPerformance Analysis of Cell and Packet Switch with Finite Input Queues and Ilpf Scheduling Algorithm
In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) sw...
متن کاملA Throughput-Enhanced Parallel Scheduling Algorithm for the MIQ Switch with a Moderate Number of Queues
Introduction: In order to overcome the throughput limit of the single input-queued (SIQ) packet switch, a number of bu ering strategies have been put forward in recent years. Among them, the virtual output-queued (VOQ) switch is receiving considerable attention, since it can yield 100% throughput depending on the scheduling algorithm employed. As a special case of the multiple input-queued (MIQ...
متن کاملMaintaining Packet Order for the Parallel Switch
In the parallel switch high-speed arrived packets (or cells) with same destination will be spread into many low-speed switching fabrics for processing. When these packets are sent to the output, however, their sequence can not be guaranteed. In this paper we propose a novel technique that includes a structure of Virtual Input Queues (VIQ) and a scheduling algorithm named Sequence keeping round-...
متن کامل